The Size of the Giant Component of a Random Graph with a Given Degree Sequence
نویسندگان
چکیده
Given a sequence of non negative real numbers which sum to we consider a random graph having approximately in ver tices of degree i In the authors essentially show that if P i i i then the graph a s has a giant component while if P i i i then a s all components in the graph are small In this paper we analyze the size of the giant component in the former case and the structure of the graph formed by deleting that compo nent We determine such that a s the giant component C has n o n vertices and the structure of the graph remaining after deleting C is basically that of a random graph with n n jCj vertices and with in of them of degree
منابع مشابه
A new approach to the giant component problem
We study the largest component of a random (multi)graph on n vertices with a given degree sequence. We let n → ∞. Then, under some regularity conditions on the degree sequences, we give conditions on the asymptotic shape of the degree sequence that imply that with high probability all the components are small, and other conditions that imply that with high probability there is a giant component...
متن کاملCDAM research report LSE-CDAM-2007-38 A NEW APPROACH TO THE GIANT COMPONENT PROBLEM
We study the largest component of a random (multi)graph on n vertices with a given degree sequence. We let n→∞. Then, under some regularity conditions on the degree sequences, we give conditions on the asymptotic shape of the degree sequence that imply that with high probability all the components are small, and other conditions that imply that with high probability there is a giant component a...
متن کاملConnected components in random graphs with given expected degree sequences
We consider a family of random graphs with a given expected degree sequence. Each edge is chosen independently with probability proportional to the product of the expected degrees of its endpoints. We examine the distribution of the sizes/volumes of the connected components which turns out depending primarily on the average degree d and the secondorder average degree d̃. Here d̃ denotes the weigh...
متن کاملThe Volume of the Giant Component of a Random Graph with Given Expected Degrees
We consider the random graph model G(w) for a given expected degree sequence w = (w1, w2, . . . , wn). If the expected average degree is strictly greater than 1, then almost surely the giant component in G of G(w) has volume (i.e., sum of weights of vertices in the giant component) equal to λ0Vol(G) +O( √ n log n), where λ0 is the unique nonzero root of the equation n ∑ i=1 wie −wiλ = (1− λ) n ∑
متن کاملNear-critical SIR epidemic on a random graph with given degrees
Emergence of new diseases and elimination of existing diseases is a key public health issue. In mathematical models of epidemics, such phenomena involve the process of infections and recoveries passing through a critical threshold where the basic reproductive ratio is 1. In this paper, we study near-critical behaviour in the context of a susceptible-infective-recovered epidemic on a random (mul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 7 شماره
صفحات -
تاریخ انتشار 1998